Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
نویسندگان
چکیده
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.
منابع مشابه
Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences
Binary Sidel’nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use ...
متن کاملLinear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
In this correspondence, the linear complexity over of Lempel–Cohn–Eastman (LCE) sequences of period 1 for an odd prime is determined. For = 3 5 and 7, the exact closed-form expressions for the linear complexity over of LCE sequences of period 1 are derived. Further, the trace representations for LCE sequences of period 1 for = 3 and 5 are found by computing the values of all Fourier coefficient...
متن کاملq-ary Lempel–Cohn–Eastman Sequences
In this paper, for a prime p and a positive integer q such that q|pn − 1, we constructed q-ary Lempel– Cohn–Eastman(LCE) sequences with period p − 1. These sequences have maximum autocorrelation magnitude bounded by 4. Particularly, in the case of q = 3, the maximum autocorrelation magnitude of the ternary LCE sequences is 3. And the maximum autocorrelation magnitude of the quaternary LCE seque...
متن کاملOn the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel’nikov sequences for arbitrary finite fields. We show that several classes of Sidel’nikov sequences over arbitrary finite fields exhibit a large linear complexity. For Sidel’nikov sequences over F8 we provide exact values for their linear complexity.
متن کاملA New Approach to Detect Congestive Heart Failure Using Symbolic Dynamics Analysis of Electrocardiogram Signal
The aim of this study is to show that the measures derived from Electrocardiogram (ECG) signals many a time perform better than the same measures obtained from heart rate (HR) signals. A comparison was made to investigate how far the nonlinear symbolic dynamics approach helps to characterize the nonlinear properties of ECG signals and HR signals, and thereby discriminate between normal and cong...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 38 شماره
صفحات -
تاریخ انتشار 2006